Approximating Reals by Sums of Rationals
نویسندگان
چکیده
Moreover, the above upper bound 1/(qN) is best possible apart from a scalar multiple when one considers the golden ratio θ = ( √ 5 − 1)/2 (for a proof, one may use Theorem 181 and bottom of page 162 in [2] on certain properties of continued fractions). During his work in [1], the author accidentally stumbled across the following analogous question: Question 1. For any real θ and any integer N ≥ 1, give an upper bound for
منابع مشابه
Approximating reals by sums of two rationals
We generalize Dirichlet's diophantine approximation theorem to approximating any real number α by a sum of two rational numbers a 1 q 1 + a 2 q 2 with denominators 1 ≤ q1, q2 ≤ N. This turns out to be related to the congruence equation problem xy ≡ c (mod q) with 1 ≤ x, y ≤ q 1/2+ǫ .
متن کاملApproximating Reals by Rationals of the Form A/b 2
In this note we formulate some questions in the study of approximations of reals by rationals of the form a/b arising in theory of Shrödinger equations. We hope to attract attention of specialists to this natural subject of number theory.
متن کاملApproximating Reals
Abstract. In this note we formulate some questions and make first steps in the study of approximations of reals by rationals of the form a/b. Such approximations appear for instance in theory of Shrödinger equations. It is sad to note that the study of these approximations, which is interesting by itself, has been omitted. We hope to attract attention of specialists to this natural subject of n...
متن کاملAdditive and Multiplicative Ramsey Theory in the Reals and the Rationals
Let a finite partition F of the real interval (0, 1) be given. We show that if every member of F is measurable or if every member of F is a Baire set, then one member of F must contain a sequence with all of its finite sums and products (and, in the measurable case, all of its infinite sums as well). These results are obtained by using the algebraic structure of the Stone-Čech compactification ...
متن کاملComputable Approximations of Reals: An Information-Theoretic Analysis
How fast can one approximate a real by a computable sequence of rationals? We show that the answer to this question depends very much on the information content in the nite pre xes of the binary expansion of the real. Computable reals, whose binary expansions have a very low information content, can be approximated (very fast) with a computable convergence rate. Random reals, whose binary expan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005